Abstract interpretation of probabilistic semantics David Monniaux http://www.di.ens.fr/~monniaux LIENS, 45 rue d’UlmParis cedex 5, France

Source URL: www-verimag.imag.fr

• Theoretical computer science
• Mathematics
• Mathematical logic
• Logic in computer science
• Programming language semantics
• Measure theory
• Boolean algebra
• Probability theory
• Denotational semantics
• Predicate transformer semantics
• Sigma-algebra
• PP

A Lattice-Based Approach to Deterministic Parallelism Lindsey Kuper and Ryan R. Newton Indiana University POPL 2013 Student Session 25 January 2013

Source URL: www.cs.indiana.edu

• Formal languages
• Probability theory
• Boolean algebra
• Measure theory
• Sigma-algebra
• Permutation

THEOREM OF THE DAY The Robbins Problem Every Robbins algebra is a Boolean algebra. A Boolean algebra is a set containing at least two elements, 0 (zero) and 1 (one); closed under three operations, +, × and ′ (compleme

Source URL: www.theoremoftheday.org

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

On the Virtue of Succinct Proofs: Amplifying Communication Complexity Hardness to Time-Space Trade-offs in Proof Complexity [Extended Abstract] Trinh Huynh

Source URL: www.complexity.ethz.ch

• Theoretical computer science
• Computational complexity theory
• Mathematics
• Automated theorem proving
• Logic in computer science
• Rules of inference
• Resolution
• Proof complexity
• Conflict-Driven Clause Learning
• Boolean algebra
• Exponential time hypothesis
• PP

Microsoft PowerPoint - Dissvortrag-Version_2007-11-08_online.ppt

Source URL: www.ruedi-arnold.com

• Logic
• Mathematical logic
• Abstraction
• Syntax
• Propositional calculus
• Non-classical logic
• Boolean algebra
• Matrix
• Well-formed formula
• Proposition
• Tautology
• First-order logic

A Fresh Look at Separation Algebras and Share Accounting? June 2009 Robert Dockins1 , Aquinas Hobor2 , and Andrew W. Appel1 1

Source URL: www.cs.princeton.edu

• Mathematics
• Mathematical logic
• Algebra
• Algebraic logic
• Fuzzy logic
• Algebraic structures
• Boolean algebra
• Algebra over a field
• Residuated Boolean algebra
• Heyting algebra

A Generalization of St˚ almarck’s Method⋆ Aditya Thakur1 and Thomas Reps1,2⋆⋆ 1 University of Wisconsin; Madison, WI, USA

Source URL: research.cs.wisc.edu

• Logic
• Mathematics
• Mathematical logic
• Boolean algebra
• Propositional calculus
• Model theory
• Propositions
• Propositional formula
• Interpretation
• Tautology
• Distributive property
• Closure

Aristotle, Boole, and Chu Duality since 350 BC Vaughan Pratt Stanford University August 27, 2015

Source URL: boole.stanford.edu

• Logic
• Mathematical logic
• Abstraction
• Boolean algebra
• Term logic
• Classical logic
• Arguments
• Syllogism
• Propositional calculus
• George Boole
• Converse
• Prior Analytics

Radial Sets: Interactive Visual Analysis of Large Overlapping Sets Bilal Alsallakh, Wolfgang Aigner, Silvia Miksch, and Helwig Hauser Fig. 1. The main interface of Radial Sets: (a) the sizes of the overlapping sets, (b)

Source URL: publik.tuwien.ac.at

• Statistics
• Diagrams
• Euler diagram
• Hypergraph
• Histogram
• Boolean algebra
• Communication design